Rank-1 Games With Exponentially Many Nash Equilibria
نویسنده
چکیده
The rank of a bimatrix game (A,B) is the rank of the matrix A + B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).
منابع مشابه
ar X iv : 1 21 1 . 24 05 v 1 [ cs . G T ] 1 1 N ov 2 01 2 Rank - 1 Games With Exponentially Many Nash Equilibria
The rank of a bimatrix game (A,B) is the rank of the matrix A + B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).
متن کاملEnumerating the Nash equilibria of rank 1-games
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke– Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-d...
متن کاملA Polynomial Time Algorithm for Rank-1 Bimatrix Games
Two player normal form game is the most basic form of game, studied extensively in game theory. Such a game can be represented by two payoff matrices (A,B), one for each player, hence they are also known as bimatrix games. The rank of a bimatrix game (A,B) is defined as the rank of matrix (A+B). For zero-sum games, i.e., rank-0, von Neumann (1928) [13] showed that Nash equilibrium are min-max s...
متن کاملNash Equilibrium Computation in Various Games
Non-cooperative Game Theory provides a framework to analyze the strategic interactions of selfish agents in any given organization. In a pioneering work, John Nash (1951) [49] proved that in any such (finite) organization, there exists a steady state where no agent benefits by unilateral deviation, henceforth called Nash equilibrium (NE). Nash equilibrium is perhaps the most well known and well...
متن کاملBilinear Games: Polynomial Time Algorithms for Rank Based Subclasses
Motivated by the sequence form formulation of Koller et al. [19], this paper defines bilinear games, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games with compact polytopal strategy sets and two payoff matrices (A, B) such that when (x, y) is the played strategy profile, the payoffs of the players are xTAy and xTBy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1211.2405 شماره
صفحات -
تاریخ انتشار 2012